Adversarial Planning in Complex Domains

Most current planning research relies on the assumption of a benign domain containing only cooperative agents. There has been little work on applying modern planning techniques to adversarial domains where this assumption does not hold. This paper discusses the development of an HTN Adversarial Planning architecture and the issues involved in successfully applying such a goal driven approach in complex domains. The architecture was tested by using it to build a reasoning system name gobi able to plan for Go problems of the types commonly found in teaching books. gobi only has limited knowledge but still performs well on a signiicant subset of Go problems. The Results also opened up interesting new approaches to tackling the problem of programming for Go but this paper concentrates on the planning aspect.